Agent deliberation via forward and backward chaining in linear logic
نویسندگان
چکیده
BDI Deliberation cycle, linear logic, forward chaining, Lygon Agent solutions to programming problems are often based on the Belief-Desire-Intention (BDI) paradigm [12]. Beliefs represent what the agent believes to be the current state of the world. Desires specify the proactive behaviour of the agent, in that the agent works to make these true. Often desires can be mutually exclusive or contradictory, requiring the agent to select from among them, and so BDI implementations often use goals, which can be thought of as desires with some restrictions on them (such as requiring goals to be consistent, feasible and not yet achieved). There can be several types of goals, including achievement goals, whcih are dropped once they have been achieved, and maintenance goals, which are continually monitored, even when currenlty true. Intentions are plans of action that the agent has committed to to achieve its current goals. Often there are many ways to achieve a set of goals that the agent is working on, implying the need for a mechanism to choose between them. Implementations of BDI systems are usually based around an observe-think-act cycle, in which an agent will observe the current environment, which may have changed since the last observation, determine which goals it should be pursuing and what plans should be used to achieve them, and choose a particular action to perform. Note that while the number of actions performed in the act phase is not specified, it is intended to be relatively small, so that the agent will be able to detect changes in the environment (which is only done in the observe phase) and respond to them within an appropriate amount of time. Hence a fundamental feature of BDI systems is the manner in which they provide both proactive (or goal-directed) and reactive behaviour. In this paper, we consider how we may adapt existing logical inference techniques to implement a BDI architecture. Using logic as a basis for the architecture will mean that we can develop methods for formal analysis of agent systems via logical inference, as well
منابع مشابه
Forward and Backward Chaining in Linear Logic
Logic programming languages based on linear logic are of both theoretical and practical interest, particulaly because such languages can be seen as providing a logical basis for programs which execute within a dynamic environment. Most linear logic programming languages are implemented using standard resolution or backward chaining techniques. However, there are many applications in which the c...
متن کاملForward Reasoning via Sequential Queries in Logic Programming
Most Prolog implementations are based on backward chaining techniques. However, there are many applications in which forward chaining ones are desirable such as in dynamic programming. In this paper, we first introduce a variant of a Prolog interpreter that computes interpolations and then introduce the notion of sequential queries. These two notions allow a combination of both forms of reasoni...
متن کاملType-2 Fuzzy Hybrid Expert System For Diagnosis Of Degenerative Disc Diseases
One-third of the people with an age over twenty have some signs of degenerated discs. However, in most of the patients the mere presence of degenerative discs is not a problem leading to pain, neurological compression, or other symptoms. This paper presents an interval type-2 fuzzy hybrid rule-based system to diagnose the abnormal degenerated discs where pain variables are represented by interv...
متن کاملForward-chaining Rules in Agent Systems
Agent systems can be divided into two broad categories of deliberative and reactive architectures. Deliberative architectures tend to excel within closed world, non real-time scenarios, offering proactive agent planning capabilities for achieving goal oriented behaviours. Reactive architectures offer timely, situation based behaviours that are suitable for application to real-time scenarios. An...
متن کاملOn focusing and polarities in linear logic and intuitionistic logic
There are a number of cut-free sequent calculus proof systems known that are complete for first-order intuitionistic logic. Proofs in these different systems can vary a great deal from one another. We are interested in providing a flexible and unifying framework that can collect together important aspects of many of these proof systems. First, we suggest that one way to unify these proof system...
متن کامل